#include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 114;
int a[N];
bool vis[N];
int n;
int main(){
    freopen("duel.in", "r", stdin);
    freopen("duel.out", "w", stdout);
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n;
    for(int i = 1;i <= n; i++){
        cin >> a[i];
    }
    sort(a + 1, a + 1 + n);
    int qp = n;
    for(int i = 1;i <= n; i++){
        vis[i] = true;
        int lft = i + 1, rgt = n;
        int ans = 0;
        while(lft <= rgt){
            int mid = (lft + rgt) >> 1;
            if(a[mid] > a[i] && !vis[mid]){
                rgt = mid - 1;
                ans = mid;
            }
            else{
                lft = mid + 1;
            }
        }
        if(ans != 0){
            vis[ans] = 1;
            qp --;
        }
        else{
            break;
        }
    }
    cout << qp << endl;
    return 0;
}